Multicolor Ramsey numbers for some paths and cycles
نویسنده
چکیده
We give the multicolor Ramsey number for some graphs with a path or a cycle in the given sequence, generalizing a results of Faudree and Schelp [4], and Dzido, Kubale and Piwakowski [2, 3].
منابع مشابه
Multicolor Ramsey Numbers for Paths and Cycles
For given graphs G1, G2, . . . , Gk, k ≥ 2, the multicolor Ramsey number R(G1, G2, . . . , Gk) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors, then it is always a monochromatic copy of some Gi, for 1 ≤ i ≤ k. We give a lower bound for k-color Ramsey number R(Cm, Cm, . . . , Cm), where m ≥ 8 is even and Cm is the cycle on m...
متن کاملOn Some Ramsey and Turan-Type Numbers for Paths and Cycles
For given graphs G1, G2, ..., Gk, where k ≥ 2, the multicolor Ramsey number R(G1, G2, ..., Gk) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors, there is always a monochromatic copy of Gi colored with i, for some 1 ≤ i ≤ k. Let Pk (resp. Ck) be the path (resp. cycle) on k vertices. In the paper we show that R(P3, Ck, Ck) = R...
متن کاملNew Lower Bound for Multicolor Ramsey Numbers for Even Cycles
For given finite family of graphs G1, G2, . . . , Gk, k ≥ 2, the multicolor Ramsey number R(G1, G2, . . . , Gk) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors then there is always a monochromatic copy of Gi colored with i, for some 1 ≤ i ≤ k. We give a lower bound for k−color Ramsey number R(Cm, Cm, . . . , Cm), where m ≥ ...
متن کاملOn the Multi-Colored Ramsey Numbers of Paths and Even Cycles
In this paper we improve the upper bound on the multi-color Ramsey numbers of paths and even cycles.
متن کاملNew lower bounds for two multicolor classical Ramsey numbers
We present an algorithm to find lower bounds for multicolor classical Ramsey numbers by using 2-normalized cyclic graphs of prime order, and use it to obtain new lower bounds for two multicolor classical Ramsey numbers: R(3, 3, 12) ≥ 182, R(3, 3, 13) ≥ 212.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 2009